Substructuring Methods for Parabolic Problems

نویسنده

  • Maksymilian Dryja
چکیده

Domain decomposition methods without overlapping for the approximation of parabolic problems are considered. Two kinds of methods are discussed. In the rst method systems of algebraic equations resulting from the approximation on each time level are solved iteratively with a Neumann-Dirichlet preconditioner. The second method is direct and similar to certain iterative methods with a Neumann-Neumann preconditioner. An analysis of convergence of the methods is presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Substructuring Preconditioners for Parabolic Problems by the Mortar Method

We study substructuring preconditioners for the linear system arising from the discretization of parabolic problems when the mortar method is applied. By using a suitable non standard norm equivalence we build an efficient edge block preconditioner and we prove a polylogarithmic bound for the condition number of the preconditioned matrix.

متن کامل

A domain decomposition discretization of parabolic problems

Abstract. In recent years, domain decomposition methods have attracted much attention due to their successful application to many elliptic and parabolic problems. Domain decomposition methods treat problems based on a domain substructuring, which is attractive for parallel computation, due to the independence among the subdomains. In principle, domain decomposition methods may be applied to the...

متن کامل

Reducing Computational and Memory Cost of Substructuring Technique in Finite Element Models

Substructuring in the finite element method is a technique that reduces computational cost and memory usage for analysis of complex structures. The efficiency of this technique depends on the number of substructures in different problems. Some subdivisions increase computational cost, but require little memory usage and vice versa. In the present study, the cost functions of computations and me...

متن کامل

Substructuring Preconditioners for Mortar Discretization of a Degenerate Evolution Problem

In this paper we present new efficient variants of structured preconditioners for algebraic linear systems arising from the mortar discretization of a degenerate parabolic system of equations. The new approaches extend and adapt the idea of substructuring preconditioners to the discretization of a degenerate problem in electrocardiology. A polylogarithmic bound for the condition number of the p...

متن کامل

A Space Decomposition Method for Parabolic Equations

A convergence proof is given for an abstract parabolic equation using general space decomposition techniques. The space decomposition technique may be a domain decomposition method, a multilevel method, or a multigrid method. It is shown that if the Euler or Crank-Nicolson scheme is used for the parabolic equation, then by suitably choosing the space decomposition, only O(jlog j) steps of itera...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1990